Local Stackelberg Equilibrium Seeking in Generalized Aggregative Games

We propose a two-layer, semidecentralized algorithm to compute local solution the Stackelberg equilibrium problem in aggregative games with coupling constraints. Specifically, we focus on single-leader, multiple-follower problem, and after equivalently recasting game as mathematical program complementarity constraints (MPCC), iteratively convexify regularized version of MPCC inner whose generates sequence feasible descent directions for original MPCC. Thus, by pursuing direction at every outer iteration, establish convergence equilibrium. Finally, proposed is tested numerical case study, hierarchical instance charging coordination plug-in electric vehicles.